Logical types for untyped languages

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Polynomial-Time Query Languages for Untyped Lists

We present a language for querying list-based complex objects. These objects are constructible with untyped nodes and hence permit arbitrary-depth sublists. The language is shown to express precisely the polynomial-time generic functions. The language controls complexity by carefully restricting the replication of values and limiting the form and nesting of recursion.

متن کامل

A Type Based Debugging Tool for Untyped Logic Languages

This paper presents a method for debugging type errors in untyped logic programs by generating type information based on abstract interpretation with OLDT resolution. The notion \type" is extended to enable the phenomena in logic programs to be described more precisely. The classes Single Types and Collected Types are introduced. An extended OLDT resolution performs combination of derived singl...

متن کامل

Logical Languages for Data Mining

Data mining focuses on the development of methods and algorithms for such tasks as classification, clustering, rule induction, and discovery of associations. In the database field, the view of data mining as advanced querying has recently stimulated much research into the development of data mining query languages. In the field of machine learning, inductive logic programming has broadened its ...

متن کامل

Logical Relations for Monadic Types

ion of the morphism 〈u, v〉 in the subscone from 〈S,m,A〉⊗̃〈S1,m1, A1〉 to 〈S2,m2, A2〉 is then the pair 〈ẽ2 ◦ ũ,Λ(v)〉 given by the diagram: S  m // ũ ## Λ(u◦e.1) 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 |A|

متن کامل

Logical types and linguistic types

One of the primary aims of linguistic semantics is to translate the expressions of natural language into formulas of some logical calculus. These formulas, in turn, can be interpreted in the appropriate models, and semantic notions like truth, entailment, etc. can be formally defined in the usual manner. In addition to the well-known theoretical advantages of such an intermediate logical form, ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: ACM SIGPLAN Notices

سال: 2010

ISSN: 0362-1340,1558-1160

DOI: 10.1145/1932681.1863561